# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def canJump_dp(self, nums: List[int]) -> bool:
        dp = [False] * len(nums)
        dp[0] = True

        for i in range(1, len(nums)):
            for j in range(0, i):
                if dp[j] and j + nums[j] >= i:
                    dp[i] = True
                    break

        return dp[-1]

    def canJump(self, nums: List[int]) -> bool:
        n = len(nums)
        max_length = 0

        for i in range(n):
            if i <= max_length:
                max_length = max(max_length, i + nums[i])
                if max_length >= n - 1:
                    return True

        return False


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([2, 3, 1, 1, 4], True),
        ([3, 2, 1, 0, 4], False)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.canJump(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

